from sys import stdin
input = stdin.readline
def main():
for _ in range(int(input())):
n = int(input())
loc = input().split()
first_1 = 0
last_1 = 0
for x, y in enumerate(loc):
if y == "0":
first_1 = x-1
break
for i in range(n-1,-1,-1):
if loc[i] == "0":
last_1 = i+1
break
print(last_1-first_1)
main()#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >>t;
while (t--){
int l;
cin >>l;
int wl[l], a=0;
for (int i=0;i<l;i++){
cin >>wl[i];
}
int cnt=0;
for (int i=0;i<l;i++){
if (wl[i]==0){
cnt=i-1;
break;
}
}
int cnt1=0;
for (int i=l;i>0;i--){
if (wl[i]==0){
cnt1=i+1;
break;
}
}
a= cnt1 - cnt;
cout <<a <<endl;
}
return 0;
}
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |